Weighted Finite Automata and Metrics in Cantor Space

نویسنده

Ludwig Staiger

چکیده

We show how weighted finite automata define topologies on the set of all ω-words over a finite alphabet X . Moreover, we give a characterization of these topologies in terms of topologies on Xω induces by languages U ⊆ X∗.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Subword Metrics for Infinite Words

The space of one-sided infinite words plays a crucial rôle in several parts of Theoretical Computer Science. Usually, it is convenient to regard this space as a metric space, the Cantor-space. It turned out that for several purposes topologies other than the one of the Cantor-space are useful, e.g. for studying fragments of first-order logic over infinite words or for a topological characterisa...

متن کامل

Bisimulation Metrics for Weighted Automata

We develop a new bisimulation (pseudo)metric for weighted finite automata (WFA) that generalizes Boreale’s linear bisimulation relation. Our metrics are induced by seminorms on the state space of WFA. Our development is based on spectral properties of sets of linear operators. In particular, the joint spectral radius of the transition matrices of WFA plays a central role. We also study continui...

متن کامل

Reduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)

This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...

متن کامل

Positive expansiveness versus network dimension in symbolic dynamical systems

A ‘symbolic dynamical system’ is a continuous transformation Φ : X−→X of closed perfect subset X ⊆ A, where A is a finite set and V is countable. (Examples include subshifts, odometers, cellular automata, and automaton networks.) The function Φ induces a directed graph structure on V, whose geometry reveals information about the dynamical system (X ,Φ). The ‘dimension’ dim(V) is an exponent des...

متن کامل